On the Completeness Theorem of Many-sorted Equational Logic and the Equivalence between Hall Algebras and Bénabou Theories
نویسندگان
چکیده
The completeness theorem of equational logic of Birkhoff asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for many-sorted deduction, founded ultimately on the congruences on Hall algebras, generalized the completeness theorem of Birkhoff to the completeness theorem of many-sorted equational logic. In this paper, after simplifying the specification of Hall algebras as given by Goguen-Meseguer, we obtain another many-sorted equational calculus from which we prove that the inference rules of abstraction and concretion due to Goguen-Meseguer are derived rules. Finally, after defining the Bénabou algebras for a set of sorts S we prove that the category of Bénabou algebras for S is equivalent to the category of Hall algebras for S and isomorphic to the category of Bénabou theories for S, i.e., the many-sorted counterpart of the category of Lawvere theories, hence that Hall algebras and Bénabou theories are equivalent.
منابع مشابه
The Completeness Theorem for Monads in Categories of Sorted Sets
Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for finitary many-sorted equational deduction, generalized the completeness theorem of Birkhoff to the completeness of finitary many-sorted equational logic and provided simultaneo...
متن کاملB -AND B - COMPLETENESS IN LOCALLY CONVEX ALGEBRAS AND THE E x THEOREM
Let E be a B-complete (B -complete) locally convex algebra and $ the topological direct sum of countably many copies of the scalar field with a jointly continuous algebra multiplication. It has been shown that E is also B-complete (B -complete) for componentwise multiplication on E . B-and Br-completeness of E , the unitization of E, and also of E x for other multiplications on E ...
متن کاملTowards Behavioral Maude: Behavioral Membership Equational Logic
How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملMinimum bases for equational theories of groups and rings: the work of Alfred Tarski and Thomas Green
Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T . In the 1960’s, Alfred Tarski and Thomas C. Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Gree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reports on Mathematical Logic
دوره 40 شماره
صفحات -
تاریخ انتشار 2006